Counting Permutations by Their Rigid Patterns
نویسنده
چکیده
In how many permutations does the pattern τ occur exactly m times? In most cases, the answer is unknown. When we search for rigid patterns, on the other hand, we obtain exact formulas for the solution, in all cases considered. keywords: pattern, rigid pattern, permutation, block Amy N. Myers Department of Mathematics 209 South 33rd Street Philadelphia, PA 19104 [email protected] phone: 215-898-4828 fax: 215-573-4063
منابع مشابه
Asymptotic behaviour of permutations avoiding generalized patterns
Visualizing permutations as labelled trees allows us to to specify restricted permutations, and to analyze their counting sequence. The asymptotic behaviour for permutations that avoid a given pattern is given by the Stanley-Wilf conjecture, which was proved by Marcus and Tardos in 2005. Another interesting question is the occurence of generalized patterns, i.e. patterns containing subwords. Th...
متن کاملApplying the Cluster Method to Count Occurrences of Generalized Permutation Patterns
Abstract. We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingŕımsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns...
متن کاملPattern Containment and Combinatorial Inequalities
We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words. If σ ∈ Sn and τ ∈ Sm, we say that σ contains τ , or τ occurs in σ, if σ has a subsequence order-isomorphic to τ . In this situation, τ is called a pattern. Similarly, if σ ∈ [k] is a string of n letters over the alphabet [k] = {1, . . . , k}, and τ ∈ [l] is a ma...
متن کاملEnumeration Schemes for Permutations Avoiding Barred Patterns
We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length 6 4. We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length > 4 or a set of barred patterns.
متن کاملAlternating, Pattern-Avoiding Permutations
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 99 شماره
صفحات -
تاریخ انتشار 2002